A relationship between linear complexity andk - error linear
نویسندگان
چکیده
The k-error linear complexity of a periodic sequence of period N is deened as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This paper shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
منابع مشابه
The Effects of Illuminants and Standard Observers Combination on Relationship between Spectrophotometric Error and Colorimetric Inaccuracy
The colorimetric error depends on the spectrophotometric inaccuracy. In this paper, a new method is introduced for determining the relationship between spectrophotometric error and colorimetric inaccuracy. The error propagation in colorimetric parameter calculation is evaluated using a linear relation between variance of reflectance spectra and CIE tristimulus values. This linear formula ca...
متن کاملDevelopment a New Technique Based on Least Square Method to Synthesize the Pattern of Equally Space Linear Arrays
Using the sampled data of a desired pattern is a common technique in pattern synthesizing of array factor (AF) of antenna arrays. Based on the obtained data matrix, Least Square Method (LSM) is used to calculate the exciting coefficient of array elements. The most important parameter, which involves the accuracy and complexity of calculation, is the sampling rate of the desired pattern. Classic...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملEmpirical Estimation of Concept Compressibility and Generalization Error
Abstract. In this paper we focus on the relationship between concept complexity and generalization error of learned concept descriptions. After showing a simple way to estimate concept complexity from learning data, we empirically link this estimation to the generalization error of different learning algorithms. While it is expected that the error increases with the complexity of the concept, q...
متن کاملA New High-order Takagi-Sugeno Fuzzy Model Based on Deformed Linear Models
Amongst possible choices for identifying complicated processes for prediction, simulation, and approximation applications, high-order Takagi-Sugeno (TS) fuzzy models are fitting tools. Although they can construct models with rather high complexity, they are not as interpretable as first-order TS fuzzy models. In this paper, we first propose to use Deformed Linear Models (DLMs) in consequence pa...
متن کامل